Improved encoding structure and decoding algorithms for spinal codes
نویسندگان
چکیده
To improve the error correction performance, an innovative encoding structure with tail-biting for spinal codes is designed. Furthermore, adaptive forward stack decoding (A-FSD) algorithm lower complexity proposed. In A-FSD algorithm, a flexible threshold parameter set by variable channel state to narrow scale of nodes accessed. On this basis, new method AFSD early termination (AFSD-ET) further The AFSD-ET decoder not only has ability dynamically modifying number stored nodes, but also adopts criterion curtail complexity. and related parameters are verified through series simulations. simulation results show that proposed algorithms can reduce rate without sacrificing correct performance.
منابع مشابه
Improved Decoding Algorithms for Reed-Solomon Codes
In coding theory, Reed-Solomon codes are one of the most well-known and widely used classes of error-correcting codes. In this thesis we study and compare two major strategies known for their decoding procedure, the Peterson-Gorenstein-Zierler (PGZ) and the Berlekamp-Massey (BM) decoder, in order to improve existing decoding algorithms and propose faster new ones. In particular we study a modif...
متن کاملUnified parallel encoding and decoding algorithms for Dandelion-like codes
The Dandelion-like codes are eight bijections between labeled trees and strings of node labels. The literature contains optimal sequential algorithms for these bijections, but no parallel algorithms have been reported. In this paper the first parallel encoding and decoding algorithms for Dandelion-like codes are presented. Namely, a unique encoding algorithm and a unique decoding algorithm, whi...
متن کاملSome Improved Encoding and Decoding
A binary code of length n is called a balanced code if each codeword contains exactly Ln/2] (or [n/21) ones and [n/2] (or n/2j) zeros. In this paper, we give two improved methods for encoding and decoding the balanced codes. The first one, called improved single map, improves the computation complexity of the complementation methods, first proposed by Knuth. This method, instead of complementin...
متن کاملNeural stochastic codes, encoding and decoding
Understanding brain function, constructing computational models and engineering neural prosthetics require assessing two problems, namely encoding and decoding, but their relation remains controversial. For decades, the encoding problem has been shown to provide insight into the decoding problem, for example, by upper bounding the decoded information. However, here we show that this need not be...
متن کاملLinear Block Codes: Encoding and Syndrome Decoding
The previous chapter defined some properties of linear block codes and discussed two examples of linear block codes (rectangular parity and the Hamming code), but the approaches presented for decoding them were specific to those codes. Here, we will describe a general strategy for encoding and decoding linear block codes. The decoding procedure we describe is syndrome decoding, which uses the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Chinese Journal of Systems Engineering and Electronics
سال: 2022
ISSN: ['1004-4132']
DOI: https://doi.org/10.23919/jsee.2022.000084